POINT SET LABELING WITH SPECIFIED POSITIONS
نویسندگان
چکیده
منابع مشابه
Adaptive Zooming in Point Set Labeling
A set of points shown on the map usually represents special sites like cities or towns in a country. If the map in the interactive geographical information system (GIS) is browsed by users on the computer screen or on the web, the points and their labels can be viewed in a query window at different resolutions by zooming in or out according to the users’ requirements. How can we make use of the...
متن کاملPoint Processes with Specified Low Order Correlations
Given functions ρk(r1, ..., rk), defined on (R d)k or (Zd)k for k = 1, ..., n, we wish to determine whether they are the first n correlation functions of some point process in Rd or Zd, respectively, and if so what we can say about the process. We give partial answers to these questions and discuss some examples.
متن کاملPoint labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some nite number of positions. We show that continuously sliding labels allows more points to be labeled both in theory and in practice. We de ne six di erent models of labeling, and analyze how much better | more points get a label | one model can be than another. We show that maximizin...
متن کاملIS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying
We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of these indexes can only process graphs of size barely up to 1 million vertices, which is rather small in view of many of the fast-growing real-world graphs today ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2002
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195902000736